Real-time hiring of vehicles for container transport
نویسنده
چکیده
This study concerns the deployment of large numbers of container transporting vehicles on a network consisting of (dedicated) roads and logistic sites such as container terminals. Each site is managed autonomously by a site manager. The fleet of vehicles is deployed by a fleet manager. On request of the site managers, the fleet manager allocates vehicles to be hired by the site managers. Next, within these allocations, each site manager issues transportation jobs and assigns these jobs to the allocated vehicles. The objective of the fleet manager is to avoid unpaid empty driving and to keep the size of its fleet just large enough the serve the demand for vehicles. The objective of the site managers is to minimize the operational costs. In this context a new coordination system is proposed to allocate vehicle capacity, operating on the basis of a win-win situation for all actors. The coordination takes place at two levels. One level concerns the drawing up of an adaptive fleet deployment plan. The other level resides under control of the individual site managers and concerns the assignment of transportation jobs to vehicles, given the allocations of the fleet deployment plan. Both use repetitive linear programming procedures. Small size simulation experiments show that the approach might be effective.
منابع مشابه
Scheduling in Container Terminals using Network Simplex Algorithm
In static scheduling problem, where there is no change in situation, the challenge is that the large problems can be solved in a short time. In this paper, the Static Scheduling problem of Automated Guided Vehicles in container terminal is solved by the Network Simplex Algorithm (NSA). The algorithm is based on graph model and their performances are at least 100 times faster than traditional si...
متن کاملOptimizing the Static and Dynamic Scheduling problem of Automated Guided Vehicles in Container Terminals
The Minimum Cost Flow (MCF) problem is a well-known problem in the area of network optimisation. To tackle this problem, Network Simplex Algorithm (NSA) is the fastest solution method. NSA has three extensions, namely Network Simplex plus Algorithm (NSA+), Dynamic Network Simplex Algorithm (DNSA) and Dynamic Network Simplex plus Algorithm (DNSA+). The objectives of the research reported in this...
متن کاملAn Efficient Extension of Network Simplex Algorithm
In this paper, an efficient extension of network simplex algorithm is presented. In static scheduling problem, where there is no change in situation, the challenge is that the large problems can be solved in a short time. In this paper, the Static Scheduling problem of Automated Guided Vehicles in container terminal is solved by Network Simplex Algorithm (NSA) and NSA+, which extended the stand...
متن کاملModeling the Container Selection for Freight Transportation: Case Study of Iran
Significant advantages of intermodal and containerized transport have increased the global interest to this mode of transportation. This growing interest is reflected in the annual volume of container cargo growth. However, the container transport inside Iran does not have a proper place. Comparing the count of containers entering and leaving ports with the statistics obtained from railway and ...
متن کاملScheduling Single-Load and Multi-Load AGVs in Container Terminals
In this paper, three solutions for scheduling problem of the Single-Load and Multi-Load Automated Guided Vehicles (AGVs) in Container Terminals are proposed. The problem is formulated as Constraint Satisfaction and Optimization. When capacity of the vehicles is one container, the problem is a minimum cost flow model. This model is solved by the highest performance Algorithm, i.e. Network Simple...
متن کامل